Embeddings of graphs with no short noncontractible cycles
نویسنده
چکیده
We investigate embeddings of graphs on orientable 2-dimensional surfaces such that all face boundaries have fewer edges than every noncontractible cycle. We show that such embeddings are always minimum genus embeddings and that they share many properties with planar embeddings. For example, if the graph is 3-connected, then the embedding is unique. We use this to obtain a polynomially bounded algorithm for describing a minimum genus embedding with no short noncontractible cycles if such an embedding of the graph exists. We reline some of these results for triangulations.
منابع مشابه
Disjoint Essential Cycles
Graphs that have two disjoint noncontractible cycles in every possible embedding in surfaces are characterized. Similar characterization is given for the class of graphs whose orientable embeddings (embeddings in surfaces different from the projective plane, respectively) always have two disjoint noncontractible cycles. For graphs which admit embeddings in closed surfaces without having two dis...
متن کاملSeparating Cycles in Doubly Toroidal Embeddings
We show that every 4-representative graph embedding in the double torus contains a noncontractible cycle which separates the surface into two pieces. This improves a result of Zha and Zhao for general orientable surfaces, in which the same conclusion holds for 6-representative graph embeddings. Noncontractible separating cycles have been studied because they provide a way to do induction on the...
متن کاملPlanar Graphs on Nonplanar Surfaces
It is shown that embeddings of planar graphs in arbitrary surfaces other than the 2-sphere have a special structure. It turns out that these embeddings can be described in terms of noncontractible curves in the surface, meeting the graph in at most two points (which may taken to be vertices of the graph). The close connection between the homology group of the surface and the planar graph embedd...
متن کاملSeparating and Nonseparating Disjoint Homotopic Cycles in Graph Embeddings
We show that if a graph G is embedded in a surface 7 with representativity \, then G contains at least w(\&1)Â2x pairwise disjoint, pairwise homotopic, non-separating (in 7) cycles, and G contains at least w(\&1)Â8x&1 pairwise disjoint, pairwise homotopic, separating, noncontractible cycles. 1996 Academic Press, Inc.
متن کاملLabeling Subgraph Embeddings and Cordiality of Graphs
Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, a vertex labeling $f : V(G)rightarrow mathbb{Z}_2$ induces an edge labeling $ f^{+} : E(G)rightarrow mathbb{Z}_2$ defined by $f^{+}(xy) = f(x) + f(y)$, for each edge $ xyin E(G)$. For each $i in mathbb{Z}_2$, let $ v_{f}(i)=|{u in V(G) : f(u) = i}|$ and $e_{f^+}(i)=|{xyin E(G) : f^{+}(xy) = i}|$. A vertex labeling $f$ of a graph $G...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 48 شماره
صفحات -
تاریخ انتشار 1990